Convergence analysis of the fast sweeping method for static convex Hamilton–Jacobi equations
نویسندگان
چکیده
In this work, we study the convergence of an efficient iterative method, the fast sweeping method (FSM), for numerically solving static convex Hamilton–Jacobi equations. First, we show the convergence of the FSM on arbitrary meshes. Then we illustrate that the combination of a contraction property of monotone upwind schemes with proper orderings can provide fast convergence for iterative methods. We show that this mechanism produces different behavior from that for elliptic problems as the mesh is refined. An equivalence between the local solver of the FSM and the Hopf formula under linear approximation is also proved. Numerical examples are presented to verify our analysis.
منابع مشابه
A Fast Sweeping Method for Static Convex Hamilton-Jacobi Equations
We develop a fast sweeping method for static Hamilton-Jacobi equations with convex Hamiltonians. Local solvers and fast sweeping strategies apply to structured and unstructured meshes. With causality correctly enforced during sweepings numerical evidence indicates that the fast sweeping method converges in a finite number of iterations independent of mesh size. Numerical examples validate both ...
متن کاملA Stopping Criterion for Higher-order Sweeping Schemes for Static Hamilton-jacobi Equations
We propose an effective stopping criterion for higher-order fast sweeping schemes for static Hamilton-Jacobi equations based on ratios of three consecutive iterations. To design the new stopping criterion we analyze the convergence of the first-order Lax-Friedrichs sweeping scheme by using the theory of nonlinear iteration. In addition, we propose a fifth-order Weighted PowerENO sweeping scheme...
متن کاملHigh Order Fast Sweeping Methods for Static Hamilton-Jacobi Equations
We construct high order fast sweeping numerical methods for computing viscosity solutions of static Hamilton-Jacobi equations on rectangular grids. These methods combine high order weighted essentially non-oscillatory (WENO) approximation to derivatives, monotone numerical Hamiltonians and Gauss Seidel iterations with alternating-direction sweepings. Based on well-developed first order sweeping...
متن کاملFixed-point Fast Sweeping Weno Methods for Steady State Solution of Scalar Hyperbolic Conservation Laws
Fast sweeping methods were developed in the literature to efficiently solve static Hamilton-Jacobi equations. This class of methods utilize the Gauss-Seidel iterations and alternating sweeping strategy to achieve fast convergence rate. They take advantage of the properties of hyperbolic partial differential equations (PDEs) and try to cover a family of characteristics of the corresponding Hamil...
متن کاملA second order discontinuous Galerkin fast sweeping method for Eikonal equations
In this paper, we construct a second order fast sweeping method with a discontinuous Galerkin (DG) local solver for computing viscosity solutions of a class of static Hamilton-Jacobi equations, namely the Eikonal equations. Our piecewise linear DG local solver is built on a DG method developed recently [Y. Cheng and C.-W. Shu, A discontinuous Galerkin finite element method for directly solving ...
متن کامل